Termination in timed process algebra
نویسنده
چکیده
We investigate different forms of termination in timed process algebras. The integrated framework of discrete and dense time, relative and absolute time process algebras is extended with forms of successful and unsuccessful termination. The different algebras are interrelated by embed dings and conservative extensions.
منابع مشابه
Timed Process Algebra (With a Focus on Explicit Termination and Relative-Timing)
We treat theory and application of timed process algebra. We focus on a variant that uses explicit termination and action prefixing. This variant has some advantages over other variants. We concentrate on relative timing, but the treatment of absolute timing is similar. We treat both discrete and dense timing. We build up the theory incrementally. The different algebras are interrelated by embe...
متن کاملProcess Algebra with Explicit Termination
In ACP-style process algebra, the interpretation of a constant atomic action combines action execution with termination. In a setting with timing, different forms of termination can be distinguished: some time termination, current time slice termination, urgent termination, termination in a virtual state. In a setting with the silent action τ , we also have silent termination. This leads to pro...
متن کاملIs Timed Branching Bisimilarity a Congruence Indeed?
We show that timed branching bisimilarity as defined by Van der Zwaag [17] and Baeten and Middelburg [2] is not an equivalence relation, in case of a dense time domain. We propose an adaptation based on Van der Zwaag’s definition, and prove that the resulting timed branching bisimilarity is an equivalence indeed. Furthermore, we prove that in case of a discrete time domain, Van der Zwaag’s defi...
متن کاملSuccessful Termination in Timed CSP
In previous work the authors investigated the inconsistencies of how successful termination was modelled in Hoare, Brookes and Roscoe’s original CSP. This led to the definition of a variant of CSP, called CSPT . CSPT presents a solution to these problems by means of adding a termination axiom to the original process axioms. In this paper we investigate how successful process termination is mode...
متن کاملStatic Analysis Versus Model Checking for Bug Finding
The benefits of exposing calls and returns p. 2 A compositional approach to the stochastic dynamics of gene networks p. 4 Games other people play p. 5 Type-directed concurrency p. 6 Multiport interaction nets and concurrency p. 21 Model checking for [pi]-calculus using proof search p. 36 A game semantics of the asynchronous [pi]-calculus p. 51 Efficient on-the-fly algorithms for the analysis of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017